Inconsistent Heuristics
نویسندگان
چکیده
In the field of heuristic search it is well-known that improving the quality of an admissible heuristic can significantly decrease the search effort required to find an optimal solution. Existing literature often assumes that admissible heuristics are consistent, implying that consistency is a desirable attribute. To the contrary, this paper shows that an inconsistent heuristic can be preferable to a consistent heuristic. Theoretical and empirical results show that, in many cases, inconsistency can be used to achieve large performance improvements.
منابع مشابه
A* Search with Inconsistent Heuristics
Early research in heuristic search discovered that using inconsistent heuristics with A* could result in an exponential increase in the number of node expansions. As a result, the use of inconsistent heuristics has largely disappeared from practice. Recently, inconsistent heuristics have been shown to be effective in IDA*, especially when applying the bidirectional pathmax (BPMX) enhancement. T...
متن کاملInconsistent heuristics in theory and practice
In the field of heuristic search it is usually assumed that admissible heuristics are consistent, implying that consistency is a desirable attribute. The term “inconsistent heuristic” has, at times, been portrayed negatively, as something to be avoided. Part of this is historical: early research discovered that inconsistency can lead to poor performance for A* (nodes might be re-expanded many t...
متن کاملUsing Inconsistent Heuristics on A∗ Search
Early research in heuristic search discovered that using inconsistent heuristics in an A∗ search could result in an exponential blow-up in the number of nodes expanded. As a result, the use of inconsistent heuristics has largely disappeared from practice. However, recent research has shown that they can yield dramatic performance improvements to an IDA∗ search using the BPMX enhancement. This p...
متن کاملInconsistency and Accuracy of Heuristics with A* Search
Many studies in heuristic search suggest that the accuracy of the heuristic used has a positive impact on improving the performance of the search. In another direction, historical research perceives that the performance of heuristic search algorithms, such as A* and IDA*, can be improved by requiring the heuristics to be consistent – a property satisfied by any perfect heuristic. However, a few...
متن کامل- 1 - on Knowledge Evolution : Acquisition , Revision , Contraction
We consider evolution of Knowledge Bases caused by a sequence of basic steps of acquisition of a new information, either consistent or inconsistent with the original system. To make this process comply with the Principle of Minimal Change, a special evidence metric is introduced for measuring distance between states of knowledge. Then a novel semantics of knowledge bases is developed suggested ...
متن کامل